小型机载激光通信系统设计与验证

针对空空宽带高速通信的需求，设计了小型化机载激光通信系统。仿真分析了300 km、2.5 Gb/s无线激光链路性能，并通过运动仿真台模拟机动环境测试了系统的跟踪与通信性能，其中粗跟踪误差为533.2 μrad(1σ)，精跟踪误差为3.6 μrad(1σ)，测试数据传输240 s，通信误码率为2.82×10-9。仿真与实验验证了该系统用于远距离空空无线激光通信的可行性。     

多运营商高铁隧道移动网络覆盖方案

高铁移动网络覆盖是国内三大通信运营商的一个重点,而高铁隧道内移动网络覆盖更是运营商的一大难点痛点。文章根据我国中部省份某高铁线路覆盖规划实例,采用“设备+POI+泄漏电缆”模式,即三家运营商信号源设备通过同一POI(point of interface,多系统接入平台)接入,信号输出到泄漏电缆进行隧道覆盖,隧道口场坪站安装宽频切换天线对隧道外进行延伸覆盖,通过链路预算合理布置各运营商主设备信号源,从而实现隧道到室外的无缝覆盖。最后,根据已有成熟网络覆盖解决方案,对未来5G高铁隧道移动网络覆盖方案进行了探讨。     

企业全面预算管理与成本管理实务探究 ——以XY化学工业有限公司为例

企业管理过程中,全面预算管理与成本管理相互促进、相辅相成。针对成本管理及全面预算管理的现状及存在的问题,以陕西某化学工业有限公司(XY公司)为案例,开展了优化成本管理及全面预算管理的对策探讨。首先介绍了全面预算管理和成本管理的基本理论及两者的关系,并针对公司现状及存在的问题,提出了优化全面预算管理和成本管控的思路和措施。通过两种管理相结合的方式,形成科学、健全的管理模式,使企业在市场竞争中获得有利地位,实现企业发展的良性循环。     

低速电机驱动翻板机构的设计与校核

介绍一种低速电机驱动连杆机构来实现接水翻板的运行,连杆机构设计为反平行四边形机构,由一台低速电机作为动力源、连杆作为执行机构、推动翻板打开与合拢,实现翻板接水工作,从而保证压滤机各工艺的正常。此方案结构简单,成本低廉,运行稳定可靠。     

基于链路可靠性的两跳QoS路由

针对工业无线传感器网络对路由协议的QoS要求，研究了一种基于链路可靠性的两跳QoS路由（Link-Reliability Based Two-Hop Routing for QoS Guarantee in Industrial Wireless Sensor Networks， LRTHQR）.采用两跳速度策略和数据优先级调度策略提高实时性，采用改进的信任评估模型以选择可信路径进行路由，采用基于接收功率的链接概率和数据包重传次数作为衡量链路可靠性的指标，同时采用能够综合考虑节点剩余能量和转发能耗的转发策略，以改善网络寿命.仿真结果显示：与未考虑链路可靠性的NCSRT （NodeCredible Security Routing for IWSN Based on THTR）算法相比， LRTHQR算法在丢包率、时延以及包平均能耗方面有着明显优势；与同样侧重QoS要求的LRTHR （Link-Reliability based Two-Hop Routing）算法相比， LRTHQR算法在截止期错失率、路由开销以及包平均能耗方面有着显著提升.     

低开销负载均衡的改进型TORA协议

针对无线传感器网络拓扑快速变化、链路易拥塞断开，存在路由开销大、负载不均衡、网络生命周期短等问题，提出低开销负载均衡的改进型TORA（TORA-p）。通过定义网络变化率参数，自适应调整互联网封装协议（IMEP）中OBM包的最大重发次数，减少不必要的路由维护开销；同时，结合MAC层信息，定义链路可用性优化选路方式，自动平衡网络负载，避免关键路径和节点负载过重而过早死亡和断开。使用truetime2.0平台设定特定的仿真环境，对TORA-p算法的性能进行了详细比较分析，结果表明：TORA-p均衡了网络负载，提升了网络生命周期，同时也减少了路由开销和延时，展现出了较好的数据传输能力。     

Improved error performance for generalised spatial modulation with enhanced spectral efficiency

The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these.     

基于链接相似度和作弊系数的Spam网页识别算法

Spam网页主要通过链接作弊手段达到提高搜索排名而获利的目的,根据链接作弊的特征,引入链接相似度和作弊系数两个指标来判定网页作弊的可能性。借鉴BadRank算法思想,从Spam网页种子集合通过迭代计算链接相似度和作弊系数,并根据与种子集合的链接指向关系设置权重,将待判定的网页进行度量。最后选取Anti-Trust Rank等算法作对比实验,结果验证了本文算法在准确率和适应性方面优于对比算法。     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing

This study presents a simulation optimization approach for a hybrid flow shop scheduling problem in a real-world semiconductor back-end assembly facility. The complexity of the problem is determined based on demand and supply characteristics. Demand varies with orders characterized by different quantities, product types, and release times. Supply varies with the number of flexible manufacturing routes but is constrained in a multi-line/multi-stage production system that contains certain types and numbers of identical and unrelated parallel machines. An order is typically split into separate jobs for parallel processing and subsequently merged for completion to reduce flow time. Split jobs that apply the same qualified machine type per order are compiled for quality and traceability. The objective is to achieve the feasible minimal flow time by determining the optimal assignment of the production line and machine type at each stage for each order. A simulation optimization approach is adopted due to the complex and stochastic nature of the problem. The approach includes a simulation model for performance evaluation, an optimization strategy with application of a genetic algorithm, and an acceleration technique via an optimal computing budget allocation. Furthermore, scenario analyses of the different levels of demand, product mix, and lot sizing are performed to reveal the advantage of simulation. This study demonstrates the value of the simulation optimization approach for practical applications and provides directions for future research on the stochastic hybrid flow shop scheduling problem.